Embedded-Based Graphics Processing Unit Cluster Platform for Multiple Sequence Alignments

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedded-Based Graphics Processing Unit Cluster Platform for Multiple Sequence Alignments

High-end graphics processing units (GPUs), such as NVIDIA Tesla/Fermi/Kepler series cards with thousands of cores per chip, are widely applied to high-performance computing fields in a decade. These desktop GPU cards should be installed in personal computers/servers with desktop CPUs, and the cost and power consumption of constructing a GPU cluster platform are very high. In recent years, NVIDI...

متن کامل

Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform

There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...

متن کامل

Investigation and parallel implementation of multiple sequence alignment using graphics processing unit (GPU)

The multiple sequence alignments in bioinformatics is a basic and essential action. In order to predict secondary and tertiary structure of the proteins, it is necessary to implement multiple alignment action. Since the number of biological sequences is very high, the desired results cannot be achieved through conventional solutions in an acceptable period of time. For this purpose, algorithms ...

متن کامل

A Linear Programming Based Algorithm for Multiple Sequence Alignments

In this brief paper we discuss an approach to multiple sequence alignment based on treating the alignmenet process as a stochastic control problem. The use of a model based on a Markov decision process leads to a linear programming problem whose solution is linked to a suggested alignment. Our goal is to avoid the expense in time and computation encountered when dynamic programming based algori...

متن کامل

Segment-Based Scores for Pairwise and Multiple Sequence Alignments

In this paper, we discuss a novel scoring scheme for sequence alignments. The score of an alignment is defined as the sum of so-called weights of aligned segment pairs. A simple modification of the weight function used by the original version of the DIALIGN alignment program turns out to have a crucial advantage: it can be applied to both, global and local alignment problems without the need to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Evolutionary Bioinformatics

سال: 2017

ISSN: 1176-9343,1176-9343

DOI: 10.1177/1176934317724764